Taming teams with mind changes
نویسندگان
چکیده
منابع مشابه
Learning Recursive Languages with Bounded Mind Changes
In the present paper we study the learnability of enumerable families L of uniformly recursive languages in dependence on the number of allowed mind changes, i.e., with respect to a well{studied measure of e ciency. We distinguish between exact learnability (L has to be inferred w.r.t. L) and class preserving learning (L has to be inferred w.r.t. some suitable chosen enumeration of all the lang...
متن کاملTeaching Learners with Restricted Mind Changes
Within learning theory teaching has been studied in various ways. In a common variant the teacher has to teach all learners that are restricted to output only consistent hypotheses. The complexity of teaching is then measured by the maximum number of mistakes a consistent learner can make until successful learning. This is equivalent to the so-called teaching dimension. However, many interestin...
متن کاملTaming elephantiasis with acitretin
Medical School, The University of Sydney, Camperdown, NSW 2050, Australia We present two patients with elephantiasis nostras verrucosa of the lower limbs which improved with oral acitretin. One patient was young and otherwise well while the other was a diabetic with multiple co-morbidities. The treatment was well tolerated and resulted in flattening of verrucous and hyperkeratotic skin lesions ...
متن کاملMind the Gap! Understanding Knowledge in Global Software Teams
This paper presents a conceptual framework and preliminary empirical analysis of knowledge gaps between global software team members in the UK and India. Drawing on episodes from rich case study evidence of a UK software firm based in the UK and software development sites in India, the conceptual framework is used to explore the data and to understand the knowledge gaps encountered. These are i...
متن کاملThe Complexity of Mind Changes
The notion of the maximal number of mind changes for a Boolean function was defined and applied in several contexts. An application in complexity theory is the result of Wagner and Wechsung that the classes of the Boolean closure of NP are exactly the classes of the Boolean hierarchy over NP. The aim of this paper is to study the complexity of determining the maximal number of mind changes of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2008
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2007.06.008